Test-data generation and integration for long-distance e-vehicle routing

نویسندگان

چکیده

Abstract Advanced route planning algorithms are one of the key enabling technologies for emerging electric and autonomous mobility. Large realistic data sets needed to test such under conditions that capture natural time-varying traffic patterns corresponding travel-time energy-use predictions. Further, availability charging infrastructure vehicle-specific charging-power curves may be necessary support advanced planning. While some synthetic generators aspects mentioned above, no integrated testbeds include all them. We contribute with a modular testbed architecture. First, it includes semi-synthetic generator uses state-of-the-art simulator, real volume distribution patterns, EV-specific data, elevation data. These elements generation time-dependent weights in road-network graph. The ensures satisfies FIFO property, which is essential routing. Next, provides thin layer services can serve as building blocks future routing algorithms. experimental study demonstrates reproduce long-distance trips similar commercially available services.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

متن کامل

Approximation algorithms for distance constrained vehicle routing problems

We study the distance constrained vehicle routing problem (DVRP) [20, 21]: given a set of vertices in a metric space, a specified depot, and a distance bound D, find a minimum cardinality set of tours originating at the depot that covers all vertices, such that each tour has length at most D. This problem is NP-complete, even when the underlying metric is induced by a weighted star. Our main re...

متن کامل

Fault-oriented Test Generation for Multicast Routing

The unprecedented growth of the Internet and the introduction of new network services such as multicast has lead to the increased complexity of network protocols and protocol interaction Multicast protocols support a wide range of multipoint applications ranging from teleconferencing to network games Unlike traditional point to point protocols multipoint communication involves multiple senders ...

متن کامل

Distance-based path relinking for the vehicle routing problem

1 Path relinking for the vehicle routing problem Path relinking is a relatively new metaheuristic technique for combinatorial optimization, proposed by Glover (see e.g. [3]). Path relinking attempts to find new good solutions by examining the solutions that are on a path from an initial (incumbent) to a final (guiding) solution. By definition, each move on the path makes the solution more diffe...

متن کامل

Parametric Analysis of a Hover Test Vehicle Using Advanced Test Generation and Data Analysis

Large complex aerospace systems are generally validated in regions local to anticipated operating points rather than through characterization of the entire feasible operational envelope of the system. This is due to the large parameter space, and complex, highly coupled nonlinear nature of the different systems that contribute to the performance of the aerospace system. We have addressed the fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geoinformatica

سال: 2023

ISSN: ['1384-6175', '1573-7624']

DOI: https://doi.org/10.1007/s10707-022-00485-y